MacMahon's Theorem for a Set of Permutations with Given Descent Indices and Right-Maximal Records

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MacMahon's Theorem for a Set of Permutations with Given Descent Indices and Right-Maximal Records

We show that the major codes and inversion codes are equidistributed over a set of permutations with prescribed descent indices and right-maximal records.

متن کامل

Generating Functions for Permutations which Contain a Given Descent Set

A large number of generating functions for permutation statistics can be obtained by applying homomorphisms to simple symmetric function identities. In particular, a large number of generating functions involving the number of descents of a permutation σ, des(σ), arise in this way. For any given finite set S of positive integers, we develop a method to produce similar generating functions for t...

متن کامل

Counting Permutations with Given Cycle Structure and Descent Set

The purpose of this paper is to count permutations in S , with a given cycle structure and a given descent set. Our main result (Theorem 2.1) asserts that the number of these permutations can be expressed as a scalar product of two symmetric functions, one associated with the cycle structure and the other with the descent set. Both of these symmetric functions can be interpreted as characterist...

متن کامل

Permutations with given peak set

Let Sn denote the symmetric group of all permutations π = a1 . . . an of {1, . . . , n}. An index i is a peak of π if ai−1 < ai > ai+1 and we let P (π) be the set of peaks of π. Given any set S of positive integers we define P (S;n) to be the set π ∈ Sn with P (π) = S. Our main result is that for all fixed subsets of positive integers S and all sufficiently large n we have #P (S;n) = p(n)2n−#S−...

متن کامل

On the type of conjugacy classes and the set of indices of maximal subgroups

‎Let $G$ be a finite group‎. ‎By $MT(G)=(m_1,cdots,m_k)$ we denote the type of‎ ‎conjugacy classes of maximal subgroups of $G$‎, ‎which implies that $G$ has exactly $k$ conjugacy classes of‎ ‎maximal subgroups and $m_1,ldots,m_k$ are the numbers of conjugates‎ ‎of maximal subgroups of $G$‎, ‎where $m_1leqcdotsleq m_k$‎. ‎In this paper‎, ‎we‎ ‎give some new characterizations of finite groups by ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2010

ISSN: 1077-8926

DOI: 10.37236/306